Bilinear maps in Verifiable Random Functions
نویسنده
چکیده
One of the biggest reasons for the popularity and versatility of elliptic curves in cryptography, besides the lack of “better-than-black-box” discrete log algorithms, is the presence of a bilinear map. In this short paper, we look into the definitions, motivations, and constructions of VRFs and note that groups equipped with a bilinear map can be used to construct a variety of different VRFs. ∗This paper is my final paper for the course at Stanford titled “Elliptic Curves in Cryptography” by David Freeman (http: //www.stanford.edu/class/cs259c/). Results presented here are paraphrased from various papers. Any mistakes and inaccuracies are solely my own and feedback is much appreciated.
منابع مشابه
Verifiable Random Functions from Standard Assumptions
The question whether there exist verifiable random functions with exponential-sized input space and full adaptive security based on a non-interactive, constant-size assumption is a longstanding open problem. We construct the first verifiable random functions which achieve all these properties simultaneously. Our construction can securely be instantiated in groups with symmetric bilinear map, ba...
متن کاملOn the Impossibility of Structure-Preserving Deterministic Primitives
Complex cryptographic protocols are often constructed in a modular way from primitives such as signatures, commitments, and encryption schemes, verifiable random functions, etc. together with zero-knowledge proofs ensuring that these primitives are properly orchestrated by the protocol participants. Over the past decades a whole framework of discrete logarithm based primitives has evolved. This...
متن کاملConstructing Verifiable Random Functions with Large Input Spaces
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior constructions required either an interactive complexity assumption or one that could tolerate a factor 2 security loss for n-bit inputs. Our construction is practical and inspired by the pseudorandom functions of Naor and Reingold...
متن کاملSimulatable VRFs with Applications to Multi-theorem NIZK
This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to each seed SK, there is a public key PK, and for y = FPK(x), it is possible to prove that y is indeed the value of the function seeded by SK. A simulatable VRF is a VRF for which this proof can be simulated, so a simulator can pr...
متن کاملLinear threshold verifiable secret sharing in bilinear groups
In many pairing-based cryptosystems, the secret keys are elements of bilinear groups. For safeguarding such secret keys or decrypting or signing in a threshold manner, Verifiable Secret Sharing (VSS) in bilinear groups is required. In this paper, we show a method of verifiably sharing a random secret in a bilinear group. Our method is simple and practical. It can be regarded as a generalisation...
متن کامل